Complexity in O - Minimal Geometry
نویسنده
چکیده
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the combinatorial parts of similar bounds known in the case of semi-algebraic and semi-Pfaffian sets, and as a result vastly increases the applicability of results on combinatorial and topological complexity of arrangements studied in discrete and computational geometry. As a sample application, we extend a Ramsey-type theorem due to Alon et al. [4], originally proved for semi-algebraic sets of fixed description complexity to this more general setting.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملCompression Schemes, Stable Definable Families, and o-Minimal Structures
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. As a consequence, the combinatorial complexity (or density) of any definable family in a structure with a o-minimal theory is bounded by the number of parameters in the defining formula. ∗Partially supported by NSF gra...
متن کاملTopological Complexity of the Relative Closure of a Semi-Pfaffian Couple
Gabrielov introduced the notion of relative closure of a Pfaffian couple as an alternative construction of the o-minimal structure generated by Khovanskii’s Pfaffian functions. In this paper, use the notion of format (or complexity) of a Pfaffian couple to derive explicit upper-bounds for the homology of its relative closure.
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملElastic Behavior of Functionally Graded Two Tangled Circles Chamber
This paper presents the numerical elastic solution for a real problem, functionally graded chamber of hydraulic gear pumps under internal pressure. Because of the similarity and complexity for the considering geometry, a bipolar cylindrical coordinate system is used to extract the governing equations. The material properties are considered to vary along the two tangled circles with a power-law ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006